A two-dimensional search for a Gauss-Newton algorithm
نویسنده
چکیده
This paper describes a fall-back procedure for use with the Gauss-Newton method for nonlinear least-squares problems. While the basic Gauss-Newton algorithm is often successful, it is well-known that it can sometimes generate poor search directions and exhibit slow convergence. For dealing with such situations we suggest a new two-dimensional search strategy. Numerical experiments indicate that the proposed technique can be effective.
منابع مشابه
One-Dimensional Modeling of Helicopter-Borne Electromagnetic Data Using Marquardt-Levenberg Including Backtracking-Armijo Line Search Strategy
In the last decades, helicopter-borne electromagnetic (HEM) method became a focus of interest in the fields of mineral exploration, geological mapping, groundwater resource investigation and environmental monitoring. As a standard approach, researchers use 1-D inversion of the acquired HEM data to recover the conductivity/resistivity-depth models. Since the relation between HEM data and model ...
متن کاملA three-dimensional multiplicative-regularized non-linear inversion algorithm for cross-well electro- magnetic and controlled-source electromagnetic applications
We present three-dimensional inversion algorithms for inversion of cross-well electromagnetic and controlled-source electromagnetic (CSEM) data. The inversion is accomplished with a Gauss-Newton technique where the model parameters are forced to lie within their upper and lower bounds by means of a non-linear transformation procedure. The Jacobian is computed using an adjoint method. A line sea...
متن کاملA Gauss - Newton method for convex composite optimization 1
An extension of the Gauss-Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h o F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) E C. This result extends a similar convergence result due to Womersley (this journa...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملMagnetotelluric inversion for 2D anisotropic conductivity structures
We report on progress in developing a magnetotelluric inversion method for two-dimensional anisotropic conductivity distribution. A standard two-dimensional model is discretized into a number of rectangular cells, each with a constant conductivity tensor, and the solution of the inverse problem is obtained by minimizing a global objective functional consisting of data misfit, a structural const...
متن کامل